Efficiently Computable Endomorphisms for Hyperelliptic Curves
نویسندگان
چکیده
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic Jacobians, but one obstruction is the lack of explicit models of curves together with an efficiently computable endomorphism. In the case of hyperelliptic curves there are limited examples, most methods focusing on special CM curves or curves defined over a small field. In this article we describe three infinite families of curves which admit an efficiently computable endomorphism, and give algorithms for their efficient application.
منابع مشابه
Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms
As Koblitz curves were generalized to hyperelliptic Koblitz curves for faster point multiplication by Günter,et al [10], we extend the recent work of Gallant,et al [8] to hyperelliptic curves. So the extended method for speeding point multiplication applies to a much larger family of hyperelliptic curves over finite fields that have efficiently-computable endomorphisms. For this special family ...
متن کاملFour-Dimensional GLV via the Weil Restriction
The Gallant-Lambert-Vanstone (GLV) algorithm uses efficiently computable endomorphisms to accelerate the computation of scalar multiplication of points on an abelian variety. Freeman and Satoh proposed for cryptographic use two families of genus 2 curves defined over Fp which have the property that the corresponding Jacobians are (2, 2)isogenous over an extension field to a product of elliptic ...
متن کاملPairings on Hyperelliptic Curves with a Real Model
We analyse the efficiency of pairing computations on hyperelliptic curves given by a real model using a balanced divisor at infinity. Several optimisations are proposed and analysed. Genus two curves given by a real model arise when considering pairing friendly groups of order dividing p − p + 1. We compare the performance of pairings on such groups in both elliptic and hyperelliptic versions. ...
متن کاملA New Double Point Multiplication Method and its Implementation on Binary Elliptic Curves with Endomorphisms
Efficient and high-performance implementation of point multiplication is crucial for elliptic curve cryptosystems. In this paper, we present a new double point multiplication algorithm based on differential addition chains. We use our scheme to implement single point multiplication on binary elliptic curves with efficiently computable endomorphisms. Our proposed scheme has a uniform structure a...
متن کاملSpeeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
Pairings on the Jacobians of (hyper-)elliptic curves have received considerable attention not only as a tool to attack curve based cryptosystems but also as a building block for constructing cryptographic schemes with new and novel properties. Motivated by the work of Scott, we investigate how to use efficiently computable automorphisms to speed up pairing computations on two families of non-su...
متن کامل